On Survivable Access Network Design: Complexity and Algorithms Dahai Xu Elliot Anshelevich

Source URL: www.cs.rpi.edu

• Combinatorial optimization
• Graph theory
• NP-complete problems
• Network theory
• Edsger W. Dijkstra
• Steiner tree problem
• Simplex
• Matching
• Bipartite graph
• Graph
• Shortest path problem
• A* search algorithm

MCS 521 – Combinatorial Optimization Fall 2013 Problem Set 2 Lev Reyzin Due: at the beginning of class

Source URL: homepages.math.uic.edu

Discrete Tabu Search for Graph Matching Kamil Adamczewski Yumin Suh

Source URL: www.cv-foundation.org

• Graph theory
• Mathematics
• Metaheuristics
• Operations research
• Combinatorial optimization
• Computational complexity theory
• Local search
• Tabu search
• Matching
• Mathematical optimization
• Heuristic
• Search algorithm

Fifth Competition of Pseudo-Boolean Solvers (PB’10) Call for Solvers and Benchmarks http://www.cril.univ-artois.fr/PB10/ G OAL Like the previous competitions (PB05, PB06, PB07 and PB09), the goal is to assess the state

Source URL: www.cril.univ-artois.fr

• Logic in computer science
• Combinatorial optimization
• Operations research
• Numerical software
• Maximum satisfiability problem
• Constraint satisfaction
• Mathematical optimization
• Solver
• Satisfiability
• Integer programming
• Constraint
• Boolean satisfiability problem

Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011

Source URL: courses.csail.mit.edu

• Computational complexity theory
• Mathematics
• Theory of computation
• Analysis of algorithms
• Operations research
• Asymptotic analysis
• Combinatorial optimization
• Dynamic programming
• Master theorem
• Big O notation
• Knapsack problem
• Time complexity

On the Social Welfare of Mechanisms for Repeated Batch Matching∗ Elliot Anshelevich Meenal Chhabra and Sanmay Das Matthew Gerrior

Source URL: www.cs.rpi.edu

• Game theory
• Mechanism design
• Combinatorial optimization
• Matching
• Stable marriage problem
• Welfare economics
• Cardinal utility
• Strategyproofness

MCS 521 – Combinatorial Optimization Fall 2013 Problem Set 3 Lev Reyzin Due: at the beginning of class Related readings: Relevant parts of chapters 4, 5, 7, and 8

Source URL: homepages.math.uic.edu

Chapter 2 Network Flows Flow problems are among the best-understood problems in combinatorial optimization. They are rather important because of their numerous applications.

Source URL: www2.informatik.hu-berlin.de

Walk the Line: Consistent Network Updates with Bandwidth Guarantees Soudeh Ghorbani and Matthew Caesar Department of Computer Science University of Illinois at Urbana-Champaign 201 North Goodwin Avenue

Source URL: web.engr.illinois.edu

• Routing algorithms
• Search algorithms
• Mathematics
• Combinatorial optimization
• Game artificial intelligence
• A* search algorithm
• Routing
• Computing
• Applied mathematics
• Heuristic
• Edsger W. Dijkstra
• Hyper-V

APPROX 2013 and RANDOM 2013 16th Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems APPROX 2013 & 17th Intl. Workshop on Randomization and Computation RANDOM 2013 http://cui.unige.ch/tcs/r

Source URL: cui.unige.ch